Turbo codes for telemedicine applications
نویسندگان
چکیده
منابع مشابه
Turbo Codes for PCS Applications
Turbo codes are the most exciting and potentially important development in coding theory in many years. They were introduced in 1993 by Berrou, Glavieux and Thitimajshima [1], and claimed to achieve near Shannon-limit error correction performance with relatively simple component codes and large interleavers. A required Eb/No of 0.7 dB was reported for BER of 10−5 and code rate of 1/2 [1]. Howev...
متن کاملFrequently Terminated Turbo Codes. Part Ii - Applications
In Part I of this series of two papers, a new way of constructing turbo codes was proposed. The presented algorithm frequently terminates the trellis of the first component encoder by inserting tail bits into the data sequence and can almost arbitrarily change the code rate by changing the number of tails. In addition to the flexibility of the rate change, the theoretical and empirical evaluati...
متن کاملVariable Latency Turbo Codes for Wireless Multimedia Applications
| Multimedia communication systems require di erent Qualities of Service (QoS) for di erent types of information. The QoS is generally expressed in terms of a maximum acceptable latency and Bit Error Rate (BER) or Frame Error Rate (FER). In turbo coded systems a tradeo between latency and BER results from the choice of interleaver size. This tradeo can be exploited in multimedia communication s...
متن کاملTurbo Codes
The paper starts with a short overview of channel coding and the reader is reminded the concept of convolutional encoding. Bottlenecks of the traditional approach are described and the motivation behind turbo codes is explained. After examining the turbo codes design more in detail, reasons behind their efficiency are brought out. Finally, a real-world example of the turbo code used in the thir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2020
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1706/1/012156